cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yuliah Qotimah
Contact Email
yuliah@lppm.itb.ac.id
Phone
+622286010080
Journal Mail Official
jictra@lppm.itb.ac.id
Editorial Address
LPPM - ITB Center for Research and Community Services (CRCS) Building Floor 6th Jl. Ganesha No. 10 Bandung 40132, Indonesia Telp. +62-22-86010080 Fax. +62-22-86010051
Location
Kota bandung,
Jawa barat
INDONESIA
Journal of ICT Research and Applications
Published by Institut Teknologi Bandung
ISSN : 23375787     EISSN : 23385499     DOI : https://doi.org/10.5614/itbj.ict.res.appl.
Core Subject : Science,
Computer Science & IT
Journal of ICT Research and Applications welcomes full research articles in the area of Information and Communication Technology from the following subject areas: Information Theory, Signal Processing, Electronics, Computer Network, Telecommunication, Wireless & Mobile Computing, Internet Technology, Multimedia, Software Engineering, Computer Science, Information System and Knowledge Management.
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 4 Documents
 1 
Search results for , issue "Vol. 2 No. 1 (2008)" : 4 Documents clear
Uniform and NonUniform Optimum Scalar Quantisers: A Comparative Study Fendy Santoso
Journal of ICT Research and Applications Vol. 2 No. 1 (2008)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2008.2.1.1

Abstract

The aim of this research is to investigate source coding, the representation of information source output by finite R bits/symbol. The performance of optimum quantisers subject to an entropy constraint has been studied. The definitive work in this area is best summarised by Shannon's source coding theorem, that is, a source with entropy H can be encoded with arbitrarily small error probability at any rate R (bits/source output) as long as R>H. Conversely, If R<H the error probability will be driven away from zero, independent of the complexity of the encoder and the decoder employed. In this context, the main objective of engineers is however to design the optimum code. Unfortunately, the ratedistortion theorem does not provide the recipe for such a design. The theorem does, however, provide the theoretical limit so that we know how close we are to the optimum. The full understanding of the theorem also helps in setting the direction to achieve such an optimum. In this research, we have investigated the performances of two practical scalar quantisers, i.e., a LloydMax quantiser and the uniformly defined one and also a wellknown entropy coding scheme, i.e., Huffman coding against their theoretically attainable optimum performance due to Shannon's limit R. It has been shown that our uniformly defined quantiser could demonstrate superior performance. The performance improvements, in fact, are more noticeable at higher bit rates.
Coverage Range and Cost Comparison of Remote Antenna Unit Designs for Inbuilding Radio over Fiber Technology Razali Ngah; Teguh Prakoso; Tharek Abdul Rahman
Journal of ICT Research and Applications Vol. 2 No. 1 (2008)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2008.2.1.2

Abstract

Future communication needs to be ubiquitous, broadband, convergent, and seamless. Radio over fiber (RoF) technology is one of the most important enabler in access network for the technologies. Adoption of RoF faces bottleneck in optoelectronics, that they are still expensive, high power consumption, and limited in bandwidth. To solve the problem, transceiver in remote antenna unit (RAU) is developed, i.e. electroabsorption transceiver (EAT) and asymmetric FabryPerot modulator (AFPM). This paper compares their coverage range and cost in providing WCDMA and WLAN services. Needed gain of RF amplifier for supporting picocell is also discussed.
Design and Implementation of Multi Agentbased Information Fusion System for Decision Making Support (A Case Study on Military Operation) Arwin Datunaya Wahyudi Sumari; Adang Suwandi Ahmad
Journal of ICT Research and Applications Vol. 2 No. 1 (2008)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2008.2.1.3

Abstract

Quick, accurate, and complete information is highly required for supporting strategically impact decision making in a Military Operation (MO) in order to reduce the decision cycle and to minimize the loss. For that purpose, we propose, design and implement a hierarchical Multi Agentbased Information Fusion System for Decision Making Support (MAIFSDMS). The information fusion is implemented by applying Maximum Score of the Total Sum of Joint Probabilities (MSJP) fusion method and is done by a collection of Information Fusion Agents (IFA) that forms a multiagent system. MAIFS uses a combination of generalization of Dasarathy and Joint Director's Laboratory (JDL) process models for information fusion mechanism. Information fusion products that are displayed in graphical forms provide comprehensive information regarding the MO's area dynamics. By observing the graphics resulted from the information fusion, the commandant will have situational awareness and knowledge in order to make the most accurate strategic de cision as fast as possible.
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance Herry Sitepu; Carmadi Machbub; Armein Z. R. Langi; Suhono H. Supangkat
Journal of ICT Research and Applications Vol. 2 No. 1 (2008)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2008.2.1.4

Abstract

Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peertopeer network maintains accurate routing tables with complete membership information. We present UnoHop, a novel DHT protocol with O(1) lookup performance. The protocol uses an efficient mechanism to distribute events through a dissemination tree that is constructed dynamically rooted at the node that detects the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.

Page 1 of 1 | Total Record : 4

 1 

Filter by Year

2008 2008


Reset
Filter By Issues
All Issue Vol. 17 No. 2 (2023) Vol. 17 No. 1 (2023) Vol. 16 No. 3 (2022) Vol. 16 No. 2 (2022) Vol. 16 No. 1 (2022) Vol. 15 No. 3 (2021) Vol. 15 No. 2 (2021) Vol. 15 No. 1 (2021) Vol. 14 No. 3 (2021) Vol. 14 No. 2 (2020) Vol. 14 No. 1 (2020) Vol. 13 No. 3 (2019) Vol. 13 No. 2 (2019) Vol. 13 No. 1 (2019) Vol. 12 No. 3 (2018) Vol. 12 No. 2 (2018) Vol. 12 No. 1 (2018) Vol. 11 No. 3 (2017) Vol. 11 No. 2 (2017) Vol. 11 No. 1 (2017) Vol. 10 No. 3 (2016) Vol. 10 No. 2 (2016) Vol. 10 No. 1 (2016) Vol. 9 No. 3 (2015) Vol. 9 No. 2 (2015) Vol. 9 No. 1 (2015) Vol. 8 No. 3 (2015) Vol. 8 No. 2 (2014) Vol. 8 No. 1 (2014) Vol. 7 No. 3 (2013) Vol. 7 No. 2 (2013) Vol. 7 No. 1 (2013) Vol. 6 No. 3 (2012) Vol. 6 No. 2 (2012) Vol. 6 No. 1 (2012) Vol. 5 No. 3 (2011) Vol. 5 No. 2 (2011) Vol. 5 No. 1 (2011) Vol. 4 No. 2 (2010) Vol. 4 No. 1 (2010) Vol. 3 No. 2 (2009) Vol. 3 No. 1 (2009) Vol. 2 No. 2 (2008) Vol. 2 No. 1 (2008) Vol. 1 No. 2 (2007) Vol. 1 No. 1 (2007) More Issue